Efficient Composition of PVM Programs

J.Y. Cotronis, E. Floros, N. Papazis Dept. of Informatics, Univ. of Athens, Panepistimiopolis, 157 71 Athens, GREECE. tel.: +30 1 7230172 fax: +30 1 7219 561 e-mail: [cotronis, floros, papazis]@di.uoa.gr Overview Programs forming tree process communication topologies, each process communicating only with its parent and children processes, are well suited to PVM [2], whilst programs forming graph topologies demand complex programming. We outline a methodology for the efficient composition of PVM programs; we use as an example the Distribution of Maximum. application: there are terminal processes which hold an integer value and require the maximum of their values; each terminal process sends its value to an associated relay process and (eventually) receives from it the required maximum; relays receive values from their terminals, find their local maximum LM, exchange their LMs with the other relays, find their maximum, and they send to their terminal processes. The implementation (three relays, five terminals)